Broadcast Channels With Cooperating Decoders

Random Beamforming in MIMO Broadcast Channels with Cooperating Receive Antennas

In a Gaussian multiple-input multiple-output (MIMO) broadcast channel, the sum rate capacity can be achieved by dirty paper coding (DPC). Nevertheless, DPC is computationally intensive and requires that full channel state information (CSI) from all users in the system is available at the transmitter. However, with partial CSI at the transmitter, random beamforming [1] can exploit the inherent m...

Capacity Region of the Deterministic Broadcast Channel with Cooperative Decoders

A special case of the discrete memoryless cooperative broadcast channel, as defined by Dabora and Servetto, is investigated. The capacity region is provided in the case where the information messages are sent over a deterministic broadcast channel (Y1, Y2) = h(X) with a (C12, C21)-admissible conference link between the receivers. In this framework we also give the capacity in the single common ...

Broadcast channels with confidential messages

Absrfucr-Given two discrete memoryless channels @MC’s) with a common input, it is desired to transmit private messagea to receiver 1 at r&R, andcommon meswgea to both receivers at rate R,, while keeping receiver 2 as ignorant of tbe private messages as possible. Measurhg ignorance by equivocation, a single-letter characterization is given of the. achievable trfplea (RI&R,-,) where 4 is the equi...

Broadcast channels

We introduce the problem of a single source attempting to communicate information simultaneously to several receivers. The intent is to model the situation of a broadcaster with multiple receivers or a lecturer with many listeners. Thus several different channels with a common input alphabet are specified. We shall determine the families of simultaneously achievable transmission rates for many ...

Broadcast Channels